Regular maps with simple underlying graphs
نویسندگان
چکیده
A regular map is a symmetric embedding of a graph (or multigraph) on some closed surface. In this paper we consider the genus spectrum for such maps on orientable surfaces, with simple underlying graph. It is known that for some positive integers g, there is no orientably-regular map of genus g for which both the map and its dual have simple underlying graph, and also that for some g, there is no such map (with simple underlying graph) that is reflexible. We show that for over 83% of all positive integers g, there exists at least one orientably-regular map of genus g with simple underlying graph, and conjecture that there exists at least one for every positive integer g.
منابع مشابه
On symmetries of Cayley graphs and the graphs underlying regular maps
By definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orientably-regular maps (on surfaces) are arc-transitive. This paper addresses questions about how large the automorphism groups of such graphs can be. In particular, it is shown how to construct 3-valent Cayley graphs that are 5-arc-transitive (in answer to a question by Cai Heng Li), and Cayley graphs of vale...
متن کاملSymmetric Cubic Graphs of Girth at Most 7
By a symmetric graph we mean a graph X which automorphism group acts transitively on the arcs of X. A graph is s-regular if its automorphism group acts regularly on the set of its s-arcs. Tutte [31, 32] showed that every finite symmetric cubic graph is s-regular for some s ≤ 5. It is well-known that there are precisely five symmetric cubic graphs of girth less than 6. All these graphs can be re...
متن کاملCombinatorial and computational group-theoretic methods in the study of graphs, maps and polytopes with maximal symmetry
This paper gives a brief summary of various aspects of combinatorial group theory and associated computational methods, with special reference to finitely-presented groups and their applications, found useful in the study of graphs, maps and polytopes having maximal symmetry. Recent results include the determination of all arc-transitive cubic graphs on up to 2048 vertices, and of all regular m...
متن کاملArc–transitive Non–cayley Graphs from Regular Maps
We prove that the underlying graphs of p-gonal r-valent orientably regular maps are arc-transitive but non-Cayley if r ≥ 3 and p is a prime greater than r(r − 1).
متن کاملFinite Edge-transitive Cayley Graphs and Rotary Cayley Maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley graphs (normal, bi-normal, and corefree), and analysing several operations of Cayley graphs (core quotient, normal quotient, and imprimitive quotient). It provides methods for constructing and characterising various c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Comb. Theory, Ser. B
دوره 110 شماره
صفحات -
تاریخ انتشار 2015